The convergence of quasi-Gauss-Newton methods for nonlinear problems
نویسندگان
چکیده
منابع مشابه
On the convergence of quasi-Newton methods for nonsmooth problems
We develop a theory of quasi-Newton and least-change update methods for solving systems of nonlinear equations F (x) = 0. In this theory, no diierentiability conditions are necessary. Instead, we assume that F can be approximated, in a weak sense, by an aane function in a neighborhood of a solution. Using this assumption, we prove local and ideal convergence. Our theory can be applied to B-diie...
متن کاملApproximate Gauss-Newton Methods for Nonlinear Least Squares Problems
The Gauss–Newton algorithm is an iterative method regularly used for solving nonlinear least squares problems. It is particularly well suited to the treatment of very large scale variational data assimilation problems that arise in atmosphere and ocean forecasting. The procedure consists of a sequence of linear least squares approximations to the nonlinear problem, each of which is solved by an...
متن کاملConvergence factors of Newton methods for nonlinear eigenvalue problems
Consider a complex sequence {λk}k=0 convergent to λ∗ ∈ C with order p ∈ N. The convergence factor is typically defined as the fraction ck := (λk+1 − λ∗)/(λk − λ∗) in the limit k → ∞. In this paper we prove formulas characterizing ck in the limit k → ∞ for two different Newton-type methods for nonlinear eigenvalue problems. The formulas are expressed in terms of the left and right eigenvectors. ...
متن کاملGlobal Convergence of a New Hybrid Gauss--Newton Structured BFGS Method for Nonlinear Least Squares Problems
In this paper, we propose a hybrid Gauss-Newton structured BFGS method with a new update formula and a new switch criterion for the iterative matrix to solve nonlinear least squares problems. We approximate the second term in the Hessian by a positive definite BFGS matrix. Under suitable conditions, global convergence of the proposed method with a backtracking line search is established. Moreov...
متن کاملThe University of Reading Approximate Gauss-Newton methods for nonlinear least squares problems
The Gauss-Newton algorithm is an iterative method regularly used for solving nonlinear least squares problems. It is particularly well-suited to the treatment of very large scale variational data assimilation problems that arise in atmosphere and ocean forecasting. The procedure consists of a sequence of linear least squares approximations to the nonlinear problem, each of which is solved by an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1995
ISSN: 0898-1221
DOI: 10.1016/0898-1221(95)00027-v